Doubly stochastic matrices of trees
نویسندگان
چکیده
In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices II, Linear Multilinear Algebr. 45 (1998) 275–285]. © 2004 Elsevier Ltd. All rights reserved. MSC: 05C50; 15A51
منابع مشابه
A note on doubly stochastic graph matrices
A sharp lower bound for the smallest entries, among those corresponding to edges, of doubly stochastic matrices of trees is obtained, and the trees that attain this bound are characterized. This result is used to provide a negative answer to Merris’ question in [R. Merris, Doubly stochastic graph matrices II, Linear Multilin. Algebra 45 (1998) 275–285]. © 2005 Elsevier Inc. All rights reserved....
متن کاملOrdering trees by the minimal entries of doubly stochastic graph matrices
Given an n-vertex graph G, the matrix Ω(G) = (In + L(G))−1 = (ωij) is called the doubly stochastic graph matrix of G, where In is the n × n identity matrix and L(G) is the Laplacian matrix of G. Let ω(G) be the smallest element of Ω(G). Zhang and Wu [X.D. Zhang and J.X. Wu. Doubly stochastic matrices of trees. Appl. Math. Lett., 18:339–343, 2005.] determined the tree T with the minimum ω(T ) am...
متن کاملEla Ordering Trees by the Minimal Entries of Their Doubly Stochastic Graph Matrices∗
Given an n-vertex graph G, the matrix Ω(G) = (In + L(G))−1 = (ωij) is called the doubly stochastic graph matrix of G, where In is the n × n identity matrix and L(G) is the Laplacian matrix of G. Let ω(G) be the smallest element of Ω(G). Zhang and Wu [X.D. Zhang and J.X. Wu. Doubly stochastic matrices of trees. Appl. Math. Lett., 18:339–343, 2005.] determined the tree T with the minimum ω(T ) am...
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کاملDouble-null operators and the investigation of Birkhoff's theorem on discrete lp spaces
Doubly stochastic matrices play a fundamental role in the theory of majorization. Birkhoff's theorem explains the relation between $ntimes n$ doubly stochastic matrices and permutations. In this paper, we first introduce double-null operators and we will find some important properties of them. Then with the help of double-null operators, we investigate Birkhoff's theorem for descreate $l^p$ sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 18 شماره
صفحات -
تاریخ انتشار 2005